guest ::
| Home > Publications database > Algorithmen und Strukturen in C |
| Home > Publications database > Algorithmen und Strukturen in C |
| Report | PreJuSER-39219 |
; ;
1999
Forschungszentrum, Zentralbibliothek
Jülich
Please use a persistent id in citations: http://hdl.handle.net/2128/11542
Report No.: Juel-3587
Abstract: This manuscript is the basis of a lecture on algorithms and data structures. lt starts with the definition of the terms algorithm, complexity, efficiency, and the asymptotic behavior of an algorithm. Data structures are then defined on various abstraction levels and it is shown how structures like arrays, sets, lists, graphs, trees, etc. can be mapped on a computer in order to achieve efficient operations on these structures as, e.g. accessing tree elements or sorting list elements. Tue resulting data structures describe the storage method as well as the basic operations on these data. Program kernels based on the described data structures are presented in C which can be combined for the solution of more complex problems. Complexity investigations are performed for the operations presented which allow a comparison of different algorithms with respect to time and space requirements. In the second part algorithms for various tasks, e.g. searching and sorting of list elements, efficient storage methods, and graph algorithms are described. These can be used as building blocks for more complex problems. Examples from different areas are presented and analyzed with respect to their asymptotic behavior.
|
The record appears in these collections: |
PDF
PDF (PDFA)